Published in: LIPIcs, Volume 215, 13th Innovations in Theoretical Computer Science Conference (ITCS 2022)
Shuchi Chawla and Meena Jagadeesan. Individual Fairness in Advertising Auctions Through Inverse Proportionality. In 13th Innovations in Theoretical Computer Science Conference (ITCS 2022). Leibniz International Proceedings in Informatics (LIPIcs), Volume 215, pp. 42:1-42:21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
@InProceedings{chawla_et_al:LIPIcs.ITCS.2022.42, author = {Chawla, Shuchi and Jagadeesan, Meena}, title = {{Individual Fairness in Advertising Auctions Through Inverse Proportionality}}, booktitle = {13th Innovations in Theoretical Computer Science Conference (ITCS 2022)}, pages = {42:1--42:21}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-217-4}, ISSN = {1868-8969}, year = {2022}, volume = {215}, editor = {Braverman, Mark}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2022.42}, URN = {urn:nbn:de:0030-drops-156385}, doi = {10.4230/LIPIcs.ITCS.2022.42}, annote = {Keywords: Algorithmic fairness, advertising auctions} }
Published in: LIPIcs, Volume 156, 1st Symposium on Foundations of Responsible Computing (FORC 2020)
Cynthia Dwork, Christina Ilvento, and Meena Jagadeesan. Individual Fairness in Pipelines. In 1st Symposium on Foundations of Responsible Computing (FORC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 156, pp. 7:1-7:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{dwork_et_al:LIPIcs.FORC.2020.7, author = {Dwork, Cynthia and Ilvento, Christina and Jagadeesan, Meena}, title = {{Individual Fairness in Pipelines}}, booktitle = {1st Symposium on Foundations of Responsible Computing (FORC 2020)}, pages = {7:1--7:22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-142-9}, ISSN = {1868-8969}, year = {2020}, volume = {156}, editor = {Roth, Aaron}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2020.7}, URN = {urn:nbn:de:0030-drops-120235}, doi = {10.4230/LIPIcs.FORC.2020.7}, annote = {Keywords: algorithmic fairness, fairness under composition, pipelines} }
Published in: LIPIcs, Volume 145, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)
Meena Jagadeesan. Simple Analysis of Sparse, Sign-Consistent JL. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 145, pp. 61:1-61:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
@InProceedings{jagadeesan:LIPIcs.APPROX-RANDOM.2019.61, author = {Jagadeesan, Meena}, title = {{Simple Analysis of Sparse, Sign-Consistent JL}}, booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019)}, pages = {61:1--61:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-125-2}, ISSN = {1868-8969}, year = {2019}, volume = {145}, editor = {Achlioptas, Dimitris and V\'{e}gh, L\'{a}szl\'{o} A.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2019.61}, URN = {urn:nbn:de:0030-drops-112762}, doi = {10.4230/LIPIcs.APPROX-RANDOM.2019.61}, annote = {Keywords: Dimensionality reduction, Random projections, Johnson-Lindenstrauss distribution, Hanson-Wright bound, Neuroscience-based constraints} }
Feedback for Dagstuhl Publishing